翻訳と辞書 Words near each other ・ Numerary nexus ・ Numerex ・ Numeri ・ Numerian ・ Numeric ・ Numeric Annotation Glyphs ・ Numeric character reference ・ Numeric distribution ・ Numeric keypad ・ Numeric precision in Microsoft Excel ・ Numeric std ・ Numerica Credit Union ・ Numericable ・ Numericable-SFR ・ Numerical ・ Numerical 3-dimensional matching ・ Numerical Algorithms Group ・ Numerical analysis ・ Numerical aperture ・ Numerical cognition ・ Numerical continuation ・ Numerical control ・ Numerical differentiation ・ Numerical diffusion ・ Numerical digit ・ Numerical Electromagnetics Code ・ Numerical error ・ Numerical integration ・ Numerical linear algebra ・ Numerical methods for ordinary differential equations Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Numerical 3-dimensional matching ： ウィキペディア英語版 Numerical 3-dimensional matching Numerical 3-dimensional matching is an NP-complete decision problem. It is given by three multisets of integers $X$, $Y$ and $Z$, each containing $k$ elements, and a bound $b$. The goal is to select a subset $M$ of $X\backslash times\; Y\backslash times\; Z$ such that every integer in $X$, $Y$ and $Z$ occurs exactly once and that for every triple $(x,y,z)$ in the subset $x+y+z=b$ holds. This problem is labeled as () in.〔Garey, Michael R. and David S. Johnson (1979), Computers and Intractability; A Guide to the Theory of NP-Completeness. ISBN 0-7167-1045-5〕 == Example == Take $X=\backslash$, $Y=\backslash$ and $Z=\backslash$, and $b=10$. This instance has a solution, namely $\backslash$. Note that each triple sums to $b=10$. The set $\backslash$ is not a solution for several reasons: not every number is used (a $4\backslash in\; X$ is missing), a number is used too often (the $3\backslash in\; X$) and not every triple sums to $b$ (since $3+4+2=9\backslash neq\; b=10$). However, there is at least one solution to this problem, which is the property we are interested in with decision problems. If we would take $b=11$ for the same $X$, $Y$ and $Z$, this problem would have no solution (all numbers sum to $30$, which is not equal to $k\backslash cdot\; b=33$ in this case). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Numerical 3-dimensional matching」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.